Algorithm Developments for Discrete Adjoint Methods
نویسندگان
چکیده
A number of algorithmdevelopments are presented for adjoint methods using the “discrete” approach in which the discretization of the nonlinear equations is linearized and the resulting matrix is then transposed. With a new iterative procedure for solving the adjoint equations, exact numerical equivalence is maintained between the linear and adjoint discretizations. The incorporation of strong boundary conditions within the discrete approach is discussed, and dif culties associated with the use of linear perturbation and adjoint methods for applications with strong shocks are also examined.
منابع مشابه
On the discrete adjoints of adaptive time stepping algorithms
We investigate the behavior of adaptive time stepping numerical algorithms under the reverse mode of automatic differentiation (AD). By differentiating the time step controller and the error estimator of the original algorithm, reverse mode AD generates spurious adjoint derivatives of the time steps. The resulting discrete adjoint models become inconsistent with the adjoint ODE, and yield incor...
متن کاملDISCRETE SIZE AND DISCRETE-CONTINUOUS CONFIGURATION OPTIMIZATION METHODS FOR TRUSS STRUCTURES USING THE HARMONY SEARCH ALGORITHM
Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...
متن کاملDeriving Linear and Adjoint Codes for CFD using Automatic Differentiation
Sensitivity analysis is a research area of increasing interest within CFD. Recent developments in Automatic Differentiation software (AD) make the discrete adjoint methods particularly attractive. We outline the theory of adjoint sensitivities and discuss how to use AD to derive adjoint versions from CFD codes. In particular we review the properties of the four major AD packages, we explain how...
متن کاملRegularity of Bounded Tri-Linear Maps and the Fourth Adjoint of a Tri-Derivation
In this Article, we give a simple criterion for the regularity of a tri-linear mapping. We provide if f : X × Y × Z −→ W is a bounded tri-linear mapping and h : W −→ S is a bounded linear mapping, then f is regular if and only if hof is regular. We also shall give some necessary and sufficient conditions such that the fourth adjoint D^∗∗∗∗ of a tri-derivation D is again tri-derivation.
متن کاملOptimal Control of Light Propagation Governed by Eikonal Equation within Inhomogeneous Media Using Computational Adjoint Approach
A mathematical model is presented in the present study to control the light propagation in an inhomogeneous media. The method is based on the identification of the optimal materials distribution in the media such that the trajectories of light rays follow the desired path. The problem is formulated as a distributed parameter identification problem and it is solved by a numerical met...
متن کامل